Distance Distribution of Binary Codes and the Error Probability of Decoding

Decoding Error Probability of Binary Linear Block Codes

The performance of maximum-likelihood (ML) decoded binary linear block codes is addressed via the derivation of tightened upper bounds on their decoding error probability. The upper bounds on the block and bit error probabilities are valid for any memoryless, binary-input and outputsymmetric communication channel, and their effectiveness is exemplified for various ensembles of turbo-like codes ...

Bounds on the decoding error probability of binary linear codes via their spectra

Decoding Error - Correction Codes Utilizing Bit - Error Probability Estimates

The main purpose of this dissertation is to estimate the individual bit-error probabilities of binary symbols or codewords while they are being received. It turns out that the bit-error probabilities are a function of the received-bit amplitudes and the channel noise power, both of which are assumed to be unknown a-priori at the receiver. In this study coherent detection is implemented with a C...

Decoding of the Five-Error-Correcting Binary Quadratic Residue Codes

In this paper, a new efficient syndrome-weight decoding algorithm (NESWDA) is presented to decode up to five possible errors in a binary systematic (47, 24, 11) quadratic residue (QR) code. The main idea of NESWDA is based on the property cyclic codes together with the weight of syndrome difference. The advantage of the NESWDA decoding algorithm over the previous table look-up methods is that i...

Decoding of the Triple-Error-Correcting Binary Quadratic Residue Codes

In this paper, a more efficient syndrome-weight decoding algorithm (SWDA), called the enhanced syndrome-weight decoding algorithm (ESWDA), is presented to decode up to three possible errors for the binary systematic (23, 12, 7) and (31, 16, 7) quadratic residue (QR) codes. In decoding of the QR codes, the evaluation of the error-locator polynomial in the finite field is complicated and time-con...